منابع مشابه
Disjoint paths in sparse graphs
We generalize all the results obtained for maximum integer multiflow and minimum multicut problems in trees by Garg, Vazirani and Yannakakis [Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18 (1997) 3–20] to graphs with a fixed cyclomatic number, while this cannot be achieved for other classical generalizations of trees. We also introduce the k-edge-o...
متن کاملDisjoint Paths in Planar Graphs
ACKNOWLEDGEMENTS My thanks first to my advisor, Xingxing Yu. He has helped me find my strengths, and directed me toward questions which truly intrigue me. He kept me moving forward in moments of frustration, set high expectations, and provided support for me to meet them. their service on my thesis committee. I would also like to thank Robin Thomas and the rest of the faculty at Georgia Tech fo...
متن کاملInduced Disjoint Paths in Claw-Free Graphs
Paths P1, . . . , Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test whether a graph G with k pairs of specified vertices (si, ti) contains k mutually induced paths Pi such that Pi connects si and ti for i = 1, . . . , k. ...
متن کاملEdge-Disjoint Paths in Permutation Graphs
In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(|V |+ |E|)) algorithm to solve this problem on a permutation graph.
متن کاملEdge Disjoint Paths in Moderately Connected Graphs
We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using paths that are mutually edge disjoint. This leads to a variety of classic NP-complete problems, for which approximability is not well understood. We show a polylogarithmic approximation algorithm for the undirected ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2006
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.03.019